Note on $120$ degree axial coordinates

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A note on López-Dahab coordinates

López-Dahab coordinates are usually the system of choice for implementations of elliptic curves over binary fields. We give new formulas for doubling which need one squaring less and one more addition. This leads to a speed-up for binary fields in polynomial basis representation if the parameters are not fixed.

متن کامل

A note on Riemann normal coordinates

The goal of this note is to provide a recursive algorithm that allows one to calculate the expansion of the metric tensor up to the desired order in Riemann normal coordinates. We test our expressions up to fourth order and predict results up to sixth order. For an arbitrary number of symmetric partial derivatives acting on the components of the metric tensor subtle treatment is required since ...

متن کامل

A note on the dipole coordinates

by, for example, a finite difference method in the computational (μ, χ, φ) space. The above standard dipole coordinates is convenient and certainly appropriate for analytical studies in which the Earth’s dipolar field plays central roles. It also works as a base coordinates for the node and cell generation of the finite element method in the dipole geometry [2, 3]. However, when one tries to us...

متن کامل

note on degree kirchhoff index of graphs

the degree kirchhoff index of a connected graph $g$ is defined as‎ ‎the sum of the terms $d_i,d_j,r_{ij}$ over all pairs of vertices‎, ‎where $d_i$ is the‎ ‎degree of the $i$-th vertex‎, ‎and $r_{ij}$ the resistance distance between the $i$-th and‎ ‎$j$-th vertex of $g$‎. ‎bounds for the degree kirchhoff index of the line and para-line‎ ‎graphs are determined‎. ‎the special case of regular grap...

متن کامل

A note on degree-constrained subgraphs

Elementary proofs are presented for two graph theoretic results, originally proved by H. Shirazi and J. Verstraëte using the combinatorial Nullstellensatz. In an undirected graph G = (V, E) we denote by dG(v) the degree of v ∈ V . If F (v) ⊆ N is a set of forbidden degrees for every v ∈ V , then a subgraph G = (V, E) of G is called F -avoiding if dG′(v) / ∈ F (v) for all v ∈ V . Theorem 1 (Shir...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Quarterly of Applied Mathematics

سال: 1985

ISSN: 0033-569X,1552-4485

DOI: 10.1090/qam/782261